Algorithmic “Kolmogorov” Complexity
نویسنده
چکیده
The information content or complexity of an object can be measured by the length of its shortest description. For instance the string ‘01010101010101010101010101010101’ has the short description “16 repetitions of 01”, while ‘11001000011000011101111011101100’ presumably has no simpler description other than writing down the string itself. More formally, the Algorithmic “Kolmogorov” Complexity (AC) of a string x is defined as the length of the shortest program that computes or outputs x, where the program is run on some fixed reference universal computer.
منابع مشابه
Why Kolmogorov Complexity in Physical Equations?
Several researchers, including M. Gell-Mann, argue that the notion of Kolmogorov complexity, developed in the algorithmic information theory, is useful in physics (i.e., in the description of the physical world). Their arguments are rather convincing, but there seems to be a gap between traditional physical equations and Kolmogorov complexity: namely, it is not clear how the standard equations ...
متن کاملAlgorithmic Information Theory and Kolmogorov Complexity
This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), notion of randomness (Martin-Löf randomness, Mises–Church randomness), Solomonoff universal a priori probability and their properties (symmetry of information, connection between a priori probabil...
متن کاملMultisource Algorithmic Information Theory
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framework for many interesting questions about Kolmogorov complexity.
متن کاملLogical operations and Kolmogorov complexity
Conditional Kolmogorov complexity can be understood as the complexity of the problem “ ”, where is the problem “construct ” and is the problem “construct ”. Other logical operations ( ) can be interpreted in a similar way, extending Kolmogorov interpretation of intuitionistic logic and Kleene realizability. This leads to interesting problems in algorithmic information theory. Some of these ques...
متن کاملThree Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State
In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides with the new quantum Kolmogorov complexity restricted to the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approxi...
متن کاملTwo Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State
In analogy of classical Kolmogorov complexity we define a notion of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides with the new quantum Kolmogorov complexity restricted to the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approxim...
متن کامل